%******** JOURNALS *********
@STRING{amai  = "Annals of Mathematics and Aritificial Intelligence"}
@STRING{aai   = "Applied Artificial Intelligence"}
@STRING{ai    = "AI"}
@STRING{aicom = "AI Communications"}
@STRING{aim   = "The AI Magazine"}
@STRING{cacm  = "Communications of the ACM"}
@STRING{cl    = "Computational Linguistics"}
@STRING{ci    = "Computational Intelligence"}
@STRING{cog   = "Cognition"}
@STRING{cp    = "Cognitive Psychology"}
@STRING{cs    = "Cognitive Science"}
@STRING{ijmms = "International Journal of Man-Machine Studies"}
@STRING{ipl   = "Information Processing Letters"}
@STRING{jacm  = "Journal of the Association for Computing Machinery"}
@STRING{jair  = "JAIR"}
@STRING{jar   = "Journal of Automated Reasoning"}
@STRING{jcss  = "Journal of Computer and System Sciences"}
@STRING{jetai = "Journal of Experimental and Theoretical Artificial
		  Intelligence"}
@STRING{jlp   = "The Journal of Logic Programming"}
@STRING{jp    = "The Journal of Philosophy"}
@STRING{jpl   = "Journal of Philosophical Logic"}
@STRING{jsat  =  "JSAT"}
@STRING{jsl   = "Journal of Symbolic Logic"}
@STRING{jsc   = "Journal of Symbolic Computation"}
@STRING{jws   = "Journal of Web Semantics"}
@STRING{lmcs  = "Logical Methods in Computer Science"}
@STRING{lp    = "Linguistics and Philosophy"}
@STRING{NGC   = "New Generation Computing"}
@STRING{phr   = "Philosophical Review"}
@STRING{psr   = "Psychological Review"}
@STRING{sigart= "SIGART Newsletter"}
@STRING{sicomp= "SIAM Journal on Computing"}
@STRING{syn   = "Synthese"}
@STRING{tcs   = "Theoretical Computer Science"}
@STRING{theo  = "Theoria"}
@STRING{tods  = "ACM Transactions on Database Systems"}
@STRING{toplas= "ACM Transactions on Programming Languages and Systems"}

 
%******** PUBLISHERS *********
@STRING{abl      = "Ablex"}
@STRING{add      = "Addison-Wesley"}
@STRING{ap       = "Academic Press"}
@STRING{bbn      = "Bolt, Beranek, and Newman, Inc."}
@STRING{ben	 = "Benjamin/Cummings"}
@STRING{chup     = "Chicago University Press"}
@STRING{csli     = "Center for the Study of Language and Information"}
@STRING{cup      = "Cambridge University Press"}
@STRING{erl      = "Erlbaum"}
@STRING{eup      = "Edinburgh University Press"}
@STRING{hup      = "Harvard University Press"}
@STRING{IRIT     = "Institut de Recherche en Informatique de Toulouse,
		  Universit{\'e} Paul Sabatier"}
@STRING{isi      = "University of Southern California, Information Science Institute"}
@STRING{kauf     = "Morgan Kaufmann"} 
@STRING{kluwer   = "Kluwer"}
@STRING{konz     = "Zentrum Philosophie und Wissenschaftstheorie,
		  Universit{\"a}t Konstanz"}
@STRING{link     = "Department of Computer and Information Science,
Link{\"o}ping University"}
@STRING{mcgh	 = "McGraw-Hill"}
@STRING{mit      = "MIT Press"}
@STRING{nh       = "North-Holland"}
@STRING{oup      = "Oxford University Press"}
@STRING{prentice = "Prentice-Hall"}
@STRING{pit      = "Pitman"}
@STRING{reid     = "Reidel"}
@STRING{spring   = "Springer-Verlag"}
@STRING{ti	 = "Tioga"}
@STRING{tub	 = "Department of Computer Science, 
		    Technische Universit{\"a}t Berlin"}
@STRING{sri      = "SRI International, Artificial Intelligence Center"}
@string{utoronto = "Computer Science Department, University of Toronto"}
@STRING{wil      = "Wiley"}
@string{dfki     = "German Research Center for Artificial Intelligence (DFKI)"}
@string{dopp	 = "Christian Doppler Labor, Technische Universit{\"a}t Wien"}
@STRING{iwbs     = "IWBS, IBM Germany"}
@STRING{wk       = "William Kaufmann"}

@STRING{lnai     = "{L}ecture {N}otes in {A}rtificial {I}ntelligence"}
@STRING{lncs     = "{L}ecture {N}otes in {C}omputer {S}cience"}

@string{rkit     = "{KIT} {R}eport"}
@string{rlilog   = "{LILOG} {R}eport"}
@string{riwbs    = "{IWBS} {R}eport"}
@string{rrdfki    = "{DFKI} {R}esearch {R}eport"}
@string{tmdfki    = "{DFKI} {T}echnical {M}emo"}
@string{ddfki    = "{DFKI} {D}ocument"}
@string{rr       = "{R}esearch {R}eport"}
 
%******** ADDRESSES **********
@STRING{ablort      = "Norwood, NJ"}
@STRING{iwbsort     = "Stuttgart"}
@STRING{addort      = "Reading, MA"}
@STRING{addortger   = "Bonn, Germany"}
@STRING{aport       = "New York, NY"}
@STRING{bbnort	    = "Cambridge, MA"}
@STRING{benort	    = "Menlo Park, CA"}
@STRING{chuport     = "Chicago, IL"}
@STRING{csliort     = "Stanford University, Stanford, CA"}
@STRING{cuport      = "Cambridge, UK"}
@STRING{erlort      = "Hillsdale, NJ"}
@STRING{euport      = "Edinburgh, UK"}
@STRING{huport      = "Cambridge, MA"}
@string{iritort     = "Toulouse, France"}
@STRING{isiort      = "Marina del Rey, CA"}
@STRING{kaufort     = "San Francisco, CA"}
@string{nkaufort    = "San Francisco, CA"}
@string{kluwerort   = "Dordrecht, Holland"}
@STRING{konzort     = "Konstanz, Germany"}
@string{linkort     = "Link{\"o}ping, Sweden"}
@STRING{mcghort	    = "New York, NY"}
@STRING{mitort      = "Cambridge, MA"}
@STRING{nhort       = "Amsterdam, Holland"}
@STRING{ouport      = "Oxford, UK"}
@STRING{pitort      = "London, UK"}
@STRING{prenticeort = "Englewood Cliffs, NJ"}
@STRING{reidort     = "Dordrecht, Holland"}
@STRING{springort   = "Berlin,  Heidelberg, New York"}
@STRING{sriort      = "Menlo Park, CA"}
@STRING{tiort	      = "Palo Alto, CA"}
@STRING{tubort	     = "Berlin,  Germany"}
@STRING{wilort      = "Chichester, England"}
@STRING{dfkikl      = "Kaiserslautern"}
@STRING(dfkisb      = {Saarbr\"ucken})
@STRING(dopport	    = "Vienna, Austria")
@STRING(utorontoort = "Toronto, Ont.")


@INPROCEEDINGS{roamer,
 AUTHOR       = "Lu, Q. and Xu, Y. and Huang, R. and Chen, Y.",
 TITLE        = "The {Roamer} Planner Random-Walk Assisted Best-First Search",
crossref  = {IPC-2011-booklet},
    pages = {73--76},
 YEAR         = "2011"
}

@INPROCEEDINGS{arvand_herd,
 AUTHOR       = "Valenzano, R. and Nakhost, H. and M{\"u}ller, M. 
 				 and Schaeffer, J. and Sturtevant, N.",
 TITLE        = "{ArvandHerd}: Parallel Planning with a Portfolio",
crossref  = {IPC-2011-booklet},
    pages = {113--116},
 YEAR         = "2011"
}

@inproceedings{Arvand,
	Author = {Hootan Nakhost and Martin M{\"u}ller},
	Booktitle = {IJCAI},
	Date-Modified = {2010-08-17 10:27:44 -0600},
	Pages = {1766-1771},
	Title = {{Monte-Carlo} Exploration for Deterministic Planning},
	Year = {2009}}


@proceedings{IPC-2011-booklet,
 EDITOR = "Garc\'{\i}a-Olaya, \'{A}. and Jim\'{e}nez, S. and Linares L\'{o}pez, C.",
title     = {The 2011 International Planning Competition},
 BOOKTITLE         = "The 2011 International Planning Competition",
publisher = {Universidad Carlos III de Madrid},
year      = {2011}
}


@article{wei:etal:jsat-08,
  author    = {Wanxia Wei and
               Chu Min Li and
               Harry Zhang},
  title     = {A Switching Criterion for Intensification and Diversification
               in Local Search for {SAT}},
  journal   = jsat,
  volume    = {4},
  number    = {2-4},
  year      = {2008},
  pages     = {219-237},
}

@InProceedings{selman:etal:aaai-92,
  booktitle = 	"Proc.\ AAAI'92",
  year      = {1992},
  author = 	 "Bart Selman and Hector J. Levesque and David Mitchell",
  title = 	 "A New Method for Solving Hard Satisfiability Problems",
  pages = 	 "440-446",
}

@article{FD,
	Author = {Malte Helmert},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Ee = {http://www.jair.org/papers/paper1705.html},
	Journal = {Journal of Artificial Intelligence Research (JAIR)},
	Pages = {191-246},
	Title = {The {Fast Downward} Planning System},
	Volume = {26},
	Year = {2006}}

@inproceedings{dave,
  author    = {Sylvain Gelly and
               David Silver},
  title     = {Achieving Master Level Play in 9 x 9 Computer {Go}},
  booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008},
  year      = {2008},
  pages     = {1537-1540},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{Finnsson,
  author    = {Hilmar Finnsson and
               Yngvi Bj{\"o}rnsson},
  title     = {Simulation-Based Approach to General Game Playing},
  booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial
               Intelligence, AAAI 2008},
  year      = {2008},
  pages     = {259-264},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@book{Motwani,
 author = {Motwani, Rajeev and Raghavan, Prabhakar},
 title = {Randomized algorithms},
 year = {1995},
 isbn = {0-521-47465-5},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
} 

@inproceedings{Identidem,
    Author = {Andrew Coles and Maria Fox and Amanda Smith},
	Booktitle = {Proc.\ ICAPS'07},
	Pages = {89--96},
	Title = {A New Local-Search Algorithm for Forward-Chaining Planning},
	Year = {2007}}

@book{Aldous, 
	title     = {Reversible Markov Chains and Random Walks on Graphs}, 
	url       = {http://stat-www.berkeley.edu/users/aldous/RWG/book.html}, 
	journal   = {Monograph in preparation}, 
	publisher = {University of California, Berkeley, Department of Statistics}, 
	author    = {Aldous, D and Fill, J}, 
	year      = {2002}
}

@book{Norris,
  author    = {James R. Norris},
  title     = {Markov chains},
  publisher = {Cambridge University Press},
  series    = {Cambridge series in statistical and probabilistic mathematics},
  year      = {1998},
  isbn      = {978-0-521-48181-6},
  pages     = {I-XVI, 1-237},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@book{Yin, title={Discrete-time Markov chains: two-time-scale methods and applications},
  author={Yin, G. and Zhang, Q.},
  isbn={9780387219486},
  lccn={2004049169},
  series={Applications of mathematics},
  year={2005},
  publisher={Springer}
}

@book{pardoux,
  title={Markov processes and applications: algorithms, networks, genome and finance},
  author    = {Pardoux, {\'E}.},
  isbn      = {9780470772713},
  lccn      = {2008043729},
  series    = {Wiley series in probability and statistics},
  year      = {2009},
  publisher = {Wiley/Dunod}
}

@article{lovasz,
  author = {Lov{\'a}sz, L.},
  journal = {Combinatorics, Paul Erdos is Eighty},
  number = 1,
  volume = 2,
  pages = {1--46},
  publisher = {J{\'a}nos Bolyai Mathematical Society},
  title = {Random walks on graphs: A survey},
  year = 1993,
}

@article{Brightwell,
 author = {Brightwell, Graham and Winkler, Peter},
 title = {Maximum hitting time for random walks on graphs},
 journal = {Random Struct. Algorithms},
 issue_date = {October 1990},
 volume = {1},
 issue = {3},
 month = {October},
 year = {1990},
 issn = {1042-9832},
 pages = {263--276},
 numpages = {14},
 publisher = {John Wiley \& Sons, Inc.},
 address = {New York, NY, USA},
} 

@inproceedings{Helmert04,
  author    = {Malte Helmert},
  title     = {A Planning Heuristic Based on Causal Graph Analysis},
  booktitle = {ICAPS},
  year      = {2004},
  pages     = {161-170},
  crossref  = {DBLP:conf/aips/2004},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/aips/2004,
  editor    = {Shlomo Zilberstein and
               Jana Koehler and
               Sven Koenig},
  title     = {Proceedings of the Fourteenth International Conference on
               Automated Planning and Scheduling (ICAPS 2004), June 3-7
               2004, Whistler, British Columbia, Canada},
  booktitle = {ICAPS},
  publisher = {AAAI},
  year      = {2004},
  isbn      = {1-57735-200-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{rw_network,
 author = {Gkantsidis, Christos and Mihail, Milena and Saberi, Amin},
 title = {Random walks in peer-to-peer networks: algorithms and evaluation},
 journal = {Perform. Eval.},
 volume = {63},
 issue = {3},
 month = {March},
 year = {2006},
 issn = {0166-5316},
 pages = {241--263},
 numpages = {23},
 url = {http://dl.acm.org/citation.cfm?id=1141193.1141199},
 doi = {10.1016/j.peva.2005.01.002},
 acmid = {1141199},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 keywords = {graph theory, peer-to-peer networks, random walks, statistics},
} 

@ARTICLE{rw_finance,
    author = {Eugene F. Fama},
    title = {Random Walks in Stock-Market Prices},
    journal = {Financial Analysts Journal},
    year = {1965},
    volume = {21},
    pages = {55--59}
}

@inproceedings{rw_supply,
  author    = {Haifeng Qian and
               Sani R. Nassif and
               Sachin S. Sapatnekar},
  title     = {Random walks in a supply network},
  booktitle = {DAC},
  year      = {2003},
  pages     = {93-98},
  ee        = {http://doi.acm.org/10.1145/775832.775860},
  crossref  = {DBLP:conf/dac/2003},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/dac/2003,
  title     = {Proceedings of the 40th Design Automation Conference, DAC
               2003, Anaheim, CA, USA, June 2-6, 2003},
  booktitle = {DAC},
  publisher = {ACM},
  year      = {2003},
  isbn      = {1-58113-688-9},
  ee        = {http://dl.acm.org/citation.cfm?id=775832},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@misc{TR,
 author = {Anonymous, A.},
  year      = {2012},
 title = {A Theoretical Model for Studying Random Walks Planning: extended version},
 note = {Technical Report. Details omitted for blind review.}
}

@inproceedings{DBLP:conf/ijcai/Cazenave09,
  author    = {Tristan Cazenave},
  title     = {Nested Monte-Carlo Search},
  booktitle = {IJCAI},
  year      = {2009},
  pages     = {456-461},
  ee        = {http://ijcai.org/papers09/Papers/IJCAI09-083.pdf},
  crossref  = {DBLP:conf/ijcai/2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@proceedings{DBLP:conf/ijcai/2009,
  editor    = {Craig Boutilier},
  title     = {IJCAI 2009, Proceedings of the 21st International Joint
               Conference on Artificial Intelligence, Pasadena, California,
               USA, July 11-17, 2009},
  year      = {2009},
  booktitle = {IJCAI}
}

